Directed Acyclic Graph Based Reliability Computation of a Network with Imperfect Nodes
نویسنده
چکیده
In this paper, a heuristic is proposed to find out the reliability of a directed network by using directed acyclic graph. This directed network has imperfect nodes as well as imperfect links. Directed acyclic graph based reliability computation involves three main steps: In the first step, built the reliability function of the given directed network which is the union of all min-paths from source to sink. In the second step, apply a heuristic approach to order the given communication links and nodes of the given directed network. Finally apply Shannon’s decomposition method to compute the reliability of the given directed network. The paper also shows that the reliability obtained by this method is equal to the reliability obtained by applying the classical inclusion-exclusion method on the given directed network.
منابع مشابه
Network Reliability Evaluation with Propositional Directed Acyclic Graphs1
This paper proposes a new and flexible approach for network reliability computation. The method is based on Propositional Directed Acyclic Graphs (PDAGs), a general graph-based language for the representation of Boolean functions. We introduce an algorithm which creates in polynomial time a generic structure function representation for reliability networks. In contrast to many existing methods,...
متن کاملظرفیت شبکه های حذفی تحت کدینگ فضایی شبکه
We study the capacity of point-to-point erasure networks under a restricted form of network coding to which we refer as spatial network coding. In this form of coding, the nodes can not perform coding on successive packets which are received from one incoming link. The coding at a node is restricted to the packets received at the same time slot from different incoming links...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملAn alternate Approach to Compute the Reliability of a Network with Imperfect Nodes using Binary Decision Diagrams
In this paper i have adopted an efficient approach for calculating the reliability of the computer communication network with the help of binary decision diagram. The computer communication network has imperfect nodes and imperfect links. It means the nodes as well as the communication links may fail with known probability. The network is represented in the form of a directed graph. First i hav...
متن کامل